Decidable Problems in Substitution Shifts
نویسندگان
چکیده
In this paper we investigate the structure of most general kind substitution shifts, including non-minimal ones and allowing erasing morphisms. We prove decidability all properties these morphisms with respect to shift space generated by iteration, such as aperiodicity, recognizability, irreducibility or minimality.
منابع مشابه
Transforming Undecidable Synthesis Problems into Decidable Problems
Synthesis holds the promise to revolutionize the development of complex systems by automating the translation from specifications to implementations. Synthesis algorithms are based on the same level of mathematical rigor as verification algorithms but can be applied at earlier development stages, when only parts of the design are available. Given a formal specification of the desired system pro...
متن کاملDecidable Problems for Unary PFAs
Given a PFA A and a cut-point λ, the isolation problem asks if there is a bound > 0 such that the acceptance probability of every word is bounded away from λ by . In this paper we show that the isolation problem for PFAs with a unary input alphabet is (a) coNPcomplete, if the cut-point is 0 or 1, and (b) is in coNP and coNP-hard, if the cut-point is in (0, 1). We also show that the language con...
متن کاملDecidable Higher-Order Unification Problems
Second order uni cation is undecidable in general Miller showed that uni cation of so called higher order patterns is decidable and unitary We show that the uni cation of a linear higher order pat tern s with an arbitrary second order term that shares no variables with s is decidable and nitary A few extensions of this uni cation problem are still decidable unifying two second order terms where...
متن کاملDecidable Problems for Counter Systems
2 This document contains a revised version of lecture notes for the advanced course " Decidable problems for counter systems " that has been delivered during ESSLLI'2010, Copenhagen, August 2010. A similar course (level M2) has been given at Département d'Informatique de l'Institut Galilée (Université Paris-Nord) for the master " Modélisation Informatique des Connaissances et du Raisonnement " ...
متن کاملDecidable and Undecidable Problems in Matrix Theory
This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of them are undecidable. The method to prove undecidabilities is the one found by Paterson [Pat] in 1970 to prove that the mortality of nitely generated matrix monoids is undecidable. This method is based on the undecidability of the Post Correspondence Problem....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4057954